Optimal convergence in naming game with geography-based negotiation on small-world networks
نویسندگان
چکیده
a Department of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefei Anhui 230026, China b School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ 85287, USA c Department of Physics, Arizona State University, Tempe, AZ 85287, USA d Department of Electronic Engineering, City University of Hong Kong, Hong Kong SAR, China e Research Center for Complex System Science, University of Shanghai for Science and Technology and Shanghai Academy of System Science, Shanghai 200093, China
منابع مشابه
Asymmetric negotiation in structured language games.
We propose an asymmetric negotiation strategy to investigate the influence of high-degree agents on the agreement dynamics in a structured language game, the naming game. We introduce a model parameter, which governs the frequency of high-degree agents acting as speakers in communication. It is found that there exists an optimal value of the parameter that induces the fastest convergence to a g...
متن کاملNaming Game on Networks: Let Everyone be Both Speaker and Hearer
To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios....
متن کاملAutomata networks for multi-party communication in the Naming Game
The Naming Game has been studied to explore the role of self-organization in the development and negotiation of linguistic conventions. In this paper, we define an automata networks approach to the Naming Game. Two problems are faced: (1) the definition of an automata networks for multi-party communicative interactions; and (2) the proof of convergence for three different orders in which the in...
متن کاملAnalysis of the “naming game” with learning errors in communications
Naming game simulates the process of naming an objective by a population of agents organized in a certain communication network. By pair-wise iterative interactions, the population reaches consensus asymptotically. We study naming game with communication errors during pair-wise conversations, with error rates in a uniform probability distribution. First, a model of naming game with learning err...
متن کاملNaming game with learning errors in communications
Naming game simulates the process of naming an objective by a population of agents organized in a certain communication network topology. By pair-wise iterative interactions, the population reaches a consensus state asymptotically. In this paper, we study naming game with communication errors during pair-wise conversations, where errors are represented by error rates in a uniform probability di...
متن کامل